Nuprl Lemma : ecl-machine1-realizes 11,40

i:Id, ds:fpf(Id; x.Type), da:fpf(Knd; k.Type), A:ecl(dsda).
normal-ds{i:l}
normal-ds(ds)
 normal-da{i:l}
 normal-da(da)
 l_all(ecl-kinds(A);
 l_all(Knd;
 l_all(k.(((isrcv(k))  (i = destination(lnk(k))  Id))  (fpf-dom(Kind-deq; kda))))
 ((fpf-dom(id-deq; mkid{ecl:ut2}; ds)))
 R-realizes{i:l}
 R-realizes(ecl-machine1{ecl:ut2}
 R-realizes(ecl-machine1(idsdaA);
 R-realizes(es.(es-decls(es;i;ds;da)
 R-realizes( (subtype_rel(es-vartype(esi; mkid{ecl:ut2}); ecl-trans-type(ecl-trans(A)))
 R-realizes( c (n:
 R-realizes( c alle-at(es;
 R-realizes( c alle-at(i;
 R-realizes( c alle-at(e.((es-bact{i:l}
 R-realizes( c alle-at(e.((es-bact(dsdaAesn; es-init(es;e); e))
 R-realizes( c alle-at( ((es-kind(ese ecl-trans-ks(ecl-trans(A)))
 R-realizes( c alle-at( c ((ecl-trans-a(ecl-trans(A))
 R-realizes( c alle-at( c (((n
 R-realizes( c alle-at( c ((,es-kind(ese)
 R-realizes( c alle-at( c ((,es-state-when(ese)
 R-realizes( c alle-at( c ((,es-val(ese)
 R-realizes( c alle-at( c ((,es-when(es; mkid{ecl:ut2}; e))))))))))) 
latex


Definitionsid-deq, ecl-kinds(x), EqDecider(T), lnk(k), fpf-dom(eqxf), Kind-deq, fpf-all(Aeqfx,v.P(x;v)), normal-da{i:l}(da), ecl(dsda), normal-ds{i:l}(ds), rec(x.A(x)), decl-state(ds), fpf(Aa.B(a)), atom{$n:n}, ecl-machine1{$ecl:ut2}(idsdaA), destination(l), isrcv(k), normal-type{i:l}(T), [], cons(carcdr), subtype(ST), isect(Ax.B(x)), void, ||as||, ge(ij), left + right, sqequal(st), sq_type(T), guard(T), R-realizes{i:l}(Res.P(es)), R-Feasible{i:l}(R), R-consistent(Res), l_all(LTx.P(x)), es-first(ese), es-kind(ese), R-state-var-init(idsdaxTvkstr), fpf-compatible(Aa.B(a); eqfg), x.A(x), es-bact{i:l}(dsdaaesne1e2), fpf-cap(feqxz), top, Type, ma-valtype(dak), es-valtype(ese), loc(e), es-init(es;e), , event_system{i:l}, <ab>, , A  B, A, False, (x  l), Knd, es-dtype(esixT), es-decls(es;i;ds;da), A c B, alle-at(esie.P(e)), xt(x), {x:AB(x)} , Id, es-E(es), P  Q, x:A  B(x), P  Q, prop{i:l}, es-after(esxe), es-trans-state-from{i:l}(es;ks;g;z;e1;e2), x:AB(x), es-when(esxe), t  T, es-vartype(esix), ecl-trans-type(A), ecl-trans-ks(v), ecl-trans-a(v), spreadn(ua,b,c,d,e,f,g.v(a;b;c;d;e;f;g)), b, mkid{$x:ut2}, ecl-trans(x), ecl-trans-tuple{i:l}(dsda), s = t, ecl-trans-act(dsdaA), f(a), ecl-act(dsdamx), P  Q, , x:AB(x), event-info(ds;da), type List, let x = a in b(x), fpf-ap(feqx), fpf-domain(f), es-isconst(esix), case b of inl(x) => s(x) | inr(y) => t(y), True, ff, tt, if b then t else f fi , kind(e), x,yt(x;y), loc(e), first(e), SWellFounded(R(x;y)), pred!(e;e'), es-le(esee'), eq_id(ab), P  Q, es-isrcv(ese), let x,y = A in B(x;y), constant_function(fAB), qle(rs), e < e', val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), rationals, Msg(M), kindcase(ka.f(a); l,t.g(l;t)), EState(T), EOrderAxioms(E;pred?;info), Unit, suptype(ST), l[i], #$n, IdLnk, a < b, t.1, l-all(Lx.P(x)), P  Q, es-state-when(ese), es-state(esi), es-val(ese), es-rcvtype(ese), es-acttype(ese), locl(a), rcv(l,tg), es-hist{i:l}(es;e1;e2), x:AB(x), append(asbs), spreadn(ax,y,z.t(x;y;z)), decidable(P), ecl-trans-state(vL), ecl-trans-init(v), ecl-trans-state-from(vzL), es-info(es;e), ecl-es-act(esmx), , @i discrete ds, t  ...$L, n + m, es-causl(esee'), es-locl(esee'), [ee'], es-pred(ese)
Lemmases-hist-last, es-interval-eq2, es-after-pred2, es-after-pred, ecl-trans-state wf, es-loc-pred, general-append-cancellation, es-pred wf, es-interval wf, map append sq, es-first-init, es-init-le, l member subtype, es-interval-less-sq, length append, length cons, length nil, es-info wf, es-interval-eq, es-init-elim2, es-init-elim, decidable assert, assert-es-bact, es-hist wf, append wf, iff functionality wrt iff, ecl-es-act-ecl-act, es-valtype wf, rcv wf, locl wf, es-acttype wf, es-rcvtype wf, es-val wf, subtype rel self, subtype rel dep function, es-state-subtype, es-state-subtype2, es-state-when wf, nat properties, rev implies wf, le wf, fpf-cap wf, IdLnk wf, select wf, length wf1, ext-eq weakening, subtype rel weakening, es-isrcv wf, assert-eq-id, es-loc-init, es-le-loc, Id sq, es-isrcv-loc, es-trans-state-from wf, es-decls-iff, unit wf, first wf, constant function wf, EState wf, kindcase wf, rationals wf, qle wf, cless wf, val-axiom wf, Msg wf, loc wf, kind wf, EOrderAxioms wf, deq wf, btrue wf, bfalse wf, false wf, true wf, es-isconst wf, es-when wf, es-after wf, alle-at wf, es-init wf, assert wf, es-bact wf, iff wf, fpf-compatible-single, R-state-var-init wf, nat wf, es-loc wf, es-E wf, es-kind wf, l member wf, es-vartype wf, es-first wf, es-dtype wf, es-decls wf, R-implies-rule, event system wf, R-consistent wf, Knd sq, cons one one, non neg length, top wf, length wf nat, isrcv wf, R-state-var-init-rule, ecl-trans-ks wf, ecl-trans-act wf, ecl-act wf, ecl-trans-tuple wf, ecl-trans wf, ecl-kinds-ecl-trans, ecl-trans-property, event-info wf, Id wf, Knd wf, bool wf, ma-valtype wf, decl-state wf, normal-ds wf, normal-da wf, fpf-trivial-subtype-top, Kind-deq wf, fpf-dom wf, lnk wf, ldst wf, ecl-kinds wf, l all wf2, id-deq wf, not wf

origin